An Action-Selection Calculus

نویسنده

  • Mark Witkowski
چکیده

This paper describes a unifying framework for five highly influential but disparate theories of natural learning and behavioral action selection. These theories are normally considered independently, with their own experimental procedures and results. The framework presented builds on a structure of connection types, propagation rules and learning rules, which are used in combination to integrate results from each theory into a whole. These connection types and rules form the Action Selection Calculus. The Calculus will be used to discuss the areas of genuine difference between the factor theories and to identify areas where there is overlap and where apparently disparate findings have a common source. The discussion is illustrated with exemplar experimental procedures. The paper focuses on predictive or anticipatory properties inherent in these action selection and learning theories, and uses the Dynamic Expectancy Model and its computer implementation SRS/E as a mechanism to conduct this discussion. Action Selection, Learning Theory, Behaviorism, Conditioning, Expectancy Model, Anticipation

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Planning with Declarative Formalizations of Heuristics for Action Selection

We propose a representation scheme for the declarative formalization of heuristics for action selection based on the situation calculus and circumscription. The formalism is applied to represent a number of heuristics for moving blocks in order to solve planning problems in the blocks world. An advice taking scenario is presented to illustrate how the action selection strategy of a program can ...

متن کامل

An analytic study on the Euler-Lagrange equation arising in calculus of variations

The Euler-Lagrange equation plays an important role in the minimization problems of the calculus of variations. This paper employs the differential transformation method (DTM) for finding the solution of the Euler-Lagrange equation which arise from problems of calculus of variations. DTM provides an analytical solution in the form of an infinite power series with easily computable components. S...

متن کامل

$-calculus Bounded Rationality = Process Algebra + Anytime Algorithms

$-calculus is a higher-order polyadic process algebra with a utility (cost) integrating deliberative and reactive approaches for action selection in real time, and allowing to capture bounded optimization and metaresoning in distributed interactive AI systems. In this paper we present basic notions of $-calculus and demonstrate the versatility of its k meta-control to plan behaviors for single ...

متن کامل

A Calculus for Overload Functions with Subtyping

We present a simple extension of typed-calculus where functions can be overloaded by putting diierent \branches of code" together. When the function is applied, the branch to execute is chosen according to a particular selection rule which depends on the type of the argument. The crucial feature of the present approach is that the branch selection depends on the \run-time type" of the argument ...

متن کامل

Variational Action Selection for Influence Diagrams

Influence diagrams provide a compact way to represent problems of decision making under uncertainty. As the number of variables in the problem increases, computing exact expectations and making optimal decisions becomes computationally intractable. A new method of action selection is presented, based on variational approximate inference. A policy is approximated where high-probability actions u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Adaptive Behaviour

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2007